Computer chess move-ordering schemes using move influence
نویسندگان
چکیده
منابع مشابه
Comparing Move Choices of Chess Search Engines
Anecdotal evidence exists that in many positions two distinct chess engines will choose different moves and, moreover, that their top-n ranking of move choices also differ. Here we set out to quantify this difference, including the difference between move choices by chess engines and those made by humans. For our analysis we used FRITZ 8 and JUNIOR 9 as representative chess search engines and t...
متن کاملMove similarity analysis in chess programs
In June 2011, the International Computer Games Association (ICGA) disqualified Vasik Rajlich and his Rybka chess program for plagiarism and breaking their rules on originality in their events from 2006-10. One primary basis for this came from a painstaking code comparison, using the source code of Fruit and the object code of Rybka, which found the selection of evaluation features in the progra...
متن کاملUsing bitboards for move generation in chess for three
“Chess for three” is an interesting chess variant, but it is still a bit underrated. This paper describes game rules shortly and proposes bitboard representation, which can be used by a computer chess program in the move generation procedure. Top-rated chess programs (e.g. Stockfish, Rybka) use it, therefore author decided to adapt it in hope of getting similar performance. Array representation...
متن کاملYour move: The effect of chess on mathematics test scores
We analyse the effect of substituting a weekly mathematics lesson in primary school grades 1-3 with a lesson in mathematics based on chess instruction. We use data from the City of Aarhus in Denmark, combining test score data with a comprehensive data set obtained from administrative registers. We use two different methodological approaches to identify and estimate treatment effects and we tend...
متن کاملA New Approach to Draw Detection by Move Repetition in Computer Chess Programming
We will try to tackle both the theoretical and practical aspects of a very important problem in chess programming as stated in the title of this article – the issue of draw detection by move repetition. The standard approach that has so far been employed in most chess programs is based on utilising positional matrices in original and compressed format as well as on the implementation of the so-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2000
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(00)00026-6